package com.codeforces.contest.c299;

import java.util.Scanner;

public class _299C {

	static Scanner scanner = new Scanner(System.in);
	static int n, ny, na, n11, ca, cy;
	static String Y, A;

	public static void main(String[] args) {
		n = scanner.nextInt();
		Y = scanner.next();
		A = scanner.next();
		ca = cy = ny = na = n11 = 0;
		for (int i=0;i<2*n;++i) {
			if (Y.charAt(i) == '1' && A.charAt(i) == '1') {
				n11++;
			}
			else if (Y.charAt(i) == '1') {
				ny++;
			}
			else if (A.charAt(i) == '1') {
				na++;
			}
		}
		if (n11 % 2 == 0) {
			n11 /= 2;
			cy += n11;
			ca += n11;
		}
		else {
			n11 /= 2;
			cy += n11 + 1;
			ca += n11;
			if (na == 0) {
				System.out.println("First");
				return;
			}
			else {
				ca++;
				na--;
			}
		}
		int m = Math.min(ny, na);
		cy += m;
		ca += m;
		ny -= m;
		na -= m;
		if (ny > 0) {
			cy += (ny+1) / 2;	
		}
		else if (na > 0) {
			ca += na / 2;
		}
		if (cy > ca) {
			System.out.println("First");
		}
		else if (cy < ca) {
			System.out.println("Second");
		}
		else {
			System.out.println("Draw");
		}
	}

}
